as the e-commerce sites are being more secure and reliable in recent years and the number of transactions is rising rapidly, parallelism can help us to reduce response time and increase throughput for e-commerce transactions. this paper will investigate parallelism in on-line transaction processing. it aims to specify those aspects of e-commerce transactions that would profit from parallel proc...

This paper gives a new application of DEA to evaluate the scheduling solutions of parallel processing. It evaluates the scheduling solutions of parallel processing using the non-convex DEA model, FDH model. By introducing each solution of parallel processing scheduling as a DMU with some relevant inputs and outputs this paper shows that how the most efficient schedule(s) can be identified.

this paper gives a new application of dea to evaluate the scheduling solutions of parallel processing. it evaluates the scheduling solutions of parallel processing using the non-convex dea model, fdh model. by introducing each solution of parallel processing scheduling as a dmu with some relevant inputs and outputs this paper shows that how the most efficient schedule(s) can be identified.

the ip lookup process is a key bottleneck in routing due to the increase in routing table size, increasing traıc and migration to ipv6 addresses. the ip address lookup involves computation of the longest prefix matching (lpm), which existing solutions such as bsd radix tries, scale poorly when traıc in the router increases or when employed for ipv6 address lookups. in this paper, we describe a ...

After briefly reviewing the appealing psychological properties of PDP systems, an introduction to their historical roots and basic computational mechanisms are provided. A variety network architectures described including one-layered perceptrons, backpropagation networks, Boltzmann machines recurrent systems. Three simulations analysed: First, a model that purports learn past tense English verb...